import java.util.Scanner;

public class HJ69 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int xhang = scanner.nextInt();
        int xlieyhang = scanner.nextInt();
        int ylie = scanner.nextInt();
        int[][] juzhen1 = new int[xhang][xlieyhang];
        int[][] juzhen2 = new int[xlieyhang][ylie];
        //先构建矩阵
        for (int i = 0; i < xhang; i++) {
            for (int j = 0; j < xlieyhang; j++) {
                juzhen1[i][j] = scanner.nextInt();
            }
        }
        for (int i = 0; i < xlieyhang; i++) {
            for (int j = 0; j < ylie; j++) {
                juzhen2[i][j] = scanner.nextInt();
            }
        }
        //接下来做矩阵相乘
        int count = 0;
        int[][] juzhen3 = new int[xhang][ylie];
        for (int i = 0; i < xhang; i++) {
            for (int j = 0; j < ylie; j++) {
                count = 0 ;
                for (int k = 0; k < juzhen1[0].length; k++) {
                    count += juzhen1[i][k]*juzhen2[k][j];
                }
                juzhen3[i][j] = count;
            }
        }

        for (int i = 0; i < juzhen3.length; i++) {
            for (int j = 0; j < juzhen3[0].length; j++) {
                System.out.print(juzhen3[i][j] + " ");
            }
            System.out.println();
        }
    }
}
